Optimizing the woodpulp stowage using Lagrangean relaxation with clusters
نویسندگان
چکیده
منابع مشابه
Optimizing the woodpulp stowage using Lagrangean relaxation with clusters
Luiz Antonio Nogueira Lorena LAC – Computer and Applied Mathematics Laboratory INPE – Brazilian Space Research Institute Av. dos Astronautas,1.758 Jd. Granja. ZIP Code: 12.227-010 São José dos Campos – SP – Brazil Tel: +55 12 3945-6555 FAX: +55 12 3945-6357 E-mail: {glaydston, lorena}@lac.inpe.br ABSTRACT The cargo stowage process in ships consists in arranging items into holds. This paper appr...
متن کاملLagrangean Relaxation with Clusters for the Uncapacitated Facility Location Problem
A good strategy for the solution of a large-scale problem is its division into small ones. In this context, this work explores the lagrangean relaxation with clusters (LagClus) that can be applied to combinatorial problems modeled by conflict graphs. By partitioning and removing the edges that connect the clusters of vertices, the conflict graph is divided in subgraphs with the same characteris...
متن کاملLagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
We consider in this paper a new lagrangean relaxation with clusters for the Manufacturer’s Pallet Loading Problem (MPLP). The relaxation is based on the MPLP formulated as a Maximum Independent Set Problem (MISP) and represented in a conflict graph that can be partitioned in clusters. The edges inter clusters are relaxed in a lagrangean fashion. Computational tests attain the optimality for som...
متن کاملLagrangean relaxation with clusters for point-feature cartographic label placement problems
This paper presents two new mathematical formulations for the Point-Feature Cartographic Label Placement Problem (PFCLP ) and a new Lagrangean relaxation with clusters (LagClus) to provide bounds to these formulations. The PFCLP can be represented by a conflict graph and the relaxation divides the graph in small sub problems (clusters) that are easily solved. The edges connecting clusters are r...
متن کاملApproximating k-cuts using Network Strength as a Lagrangean Relaxation
Given an undirected, edge-weighted connected graph, the k-cut problem is to partition the vertex set into k non-empty connected components so as to minimize the total weight of edges whose end points are in different components. We present a combinatorial polynomial-time 2-approximation algorithm for the k-cut problem. We use a La-grangean relaxation (also suggested by Barahona [2]) to reduce t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 2008
ISSN: 0160-5682,1476-9360
DOI: 10.1057/palgrave.jors.2602367